Generalized enrichment of categories
نویسندگان
چکیده
منابع مشابه
Generalized Enrichment of Categories
We define the phrase ‘category enriched in an fc-multicategory’ and explore some examples. An fc-multicategory is a very general kind of 2-dimensional structure, special cases of which are double categories, bicategories, monoidal categories and ordinary multicategories. Enrichment in an fc-multicategory extends the (more or less well-known) theories of enrichment in a monoidal category, in a b...
متن کاملGeneralized Enrichment for Categories and Multicategories
In this paper we answer the question: ‘what kind of a structure can a general multicategory be enriched in?’ (Here ‘general multicategory’ is used in the sense of [Lei1], [Bur] or [Her].) The answer is, in a sense to be made precise, that a multicategory of one type can be enriched in a multicategory of the type one level up. In particular, we will be able to speak of a Tn-multicategory enriche...
متن کاملEnrichment over iterated monoidal categories
Joyal and Street note in their paper on braided monoidal categories [9] that the 2–category V –Cat of categories enriched over a braided monoidal category V is not itself braided in any way that is based upon the braiding of V . The exception that they mention is the case in which V is symmetric, which leads to V –Cat being symmetric as well. The symmetry in V –Cat is based upon the symmetry of...
متن کاملEnrichment as Categorical Delooping I: Enrichment Over Iterated Monoidal Categories
Joyal and Street note in their paper on braided monoidal categories [10] that the 2–category V–Cat of categories enriched over a braided monoidal category V is not itself braided in any way that is based upon the braiding of V. What is meant by “based upon” here will be made more clear in the present paper. The exception that they mention is the case in which V is symmetric, which leads to V–Ca...
متن کاملOrder-Enrichment for Categories of Partial Maps
Synopsis Motivated by the desire of treating non-termination directly in the semantics of computation, the notion of approximation between programs is studied in the context of categories of partial maps. In particular, contextual approximation and specialisation are considered and shown to coincide. Moreover, after exhibiting the approximation between total maps as a primitive notion, from an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2002
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(01)00105-0